منابع مشابه
the common minimal dominating signed graph
in this paper, we define the common minimal dominating signed graph of a given signed graph and offer a structural characterization of common minimal dominating signed graphs. in the sequel, we also obtained switching equivalence characterizations: $overline{s} sim cmd(s)$ and $cmd(s) sim n(s)$, where $overline{s}$, $cmd(s)$ and $n(s)$ are complementary signed gra...
متن کاملThe H - Line Signed Graph of a Signed Graph
A Smarandachely k-signed graph (Smarandachely k-marked graph) is an ordered pair S = (G,σ) (S = (G,μ)) where G = (V, E) is a graph called underlying graph of S and σ : E → (e1, e2, ..., ek) (μ : V → (e1, e2, ..., ek)) is a function, where each ei ∈ {+,−}. Particularly, a Smarandachely 2-signed graph or Smarandachely 2-marked graph is called abbreviated a signed graph or a marked graph. Given a ...
متن کاملThe complexity of signed graph and edge-coloured graph homomorphisms
The goal of this work is to study homomorphism problems (from a computational point of view) on two superclasses of graphs: 2-edge-coloured graphs and signed graphs. On the one hand, we consider the H-Colouring problem when H is a 2-edge-coloured graph, and we show that a dichotomy theorem would imply the dichotomy conjecture of Feder and Vardi. On the other hand, we prove a dichotomy theorem f...
متن کاملOptimal Edge Deletions for Signed Graph Balancing
The Balanced Subgraph problem (edge deletion variant) asks for a 2-coloring of a graph that minimizes the inconsistencies with given edge labels. It has applications in social networks, systems biology, and integrated circuit design. We present an exact algorithm for Balanced Subgraph based on a combination of data reduction rules and a fixed-parameter algorithm. The data reduction is based on ...
متن کاملThe Signed Edge-Domatic Number of a Graph
For a nonempty graph G = (V, E), a signed edge-domination of G is a function f : E(G) → {1,−1} such that ∑e′∈NG [e] f (e′) ≥ 1 for each e ∈ E(G). The signed edge-domatic number of G is the largest integer d for which there is a set { f1, f2, . . . , fd} of signed edge-dominations of G such that ∑d i=1 fi (e) ≤ 1 for every e ∈ E(G). This paper gives an original study on this concept and determin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Indonesian Mathematical Society
سال: 2010
ISSN: 2460-0245,2086-8952
DOI: 10.22342/jims.16.2.34.105-113